Search Results

Documents authored by Heckel, Reiko

Document
DOI: 10.4230/LIPIcs.FSTTCS.2020.38
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks

Authors: Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König

Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)

Abstract
This paper exploits extended Bayesian networks for uncertainty reasoning on Petri nets, where firing of transitions is probabilistic. In particular, Bayesian networks are used as symbolic representations of probability distributions, modelling the observer’s knowledge about the tokens in the net. The observer can study the net by monitoring successful and failed steps. An update mechanism for Bayesian nets is enabled by relaxing some of their restrictions, leading to modular Bayesian nets that can conveniently be represented and modified. As for every symbolic representation, the question is how to derive information - in this case marginal probability distributions - from a modular Bayesian net. We show how to do this by generalizing the known method of variable elimination. The approach is illustrated by examples about the spreading of diseases (SIR model) and information diffusion in social networks. We have implemented our approach and provide runtime results.
Cite as

Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König. Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bernemann_et_al:LIPIcs.FSTTCS.2020.38,
  author =	{Bernemann, Rebecca and Cabrera, Benjamin and Heckel, Reiko and K\"{o}nig, Barbara},
  title =	{{Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks}},
  booktitle =	{40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
  pages =	{38:1--38:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-174-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{182},
  editor =	{Saxena, Nitin and Simon, Sunil},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.38},
  URN =		{urn:nbn:de:0030-drops-132794},
  doi =		{10.4230/LIPIcs.FSTTCS.2020.38},
  annote =	{Keywords: uncertainty reasoning, probabilistic knowledge, Petri nets, Bayesian networks}
}
Document
DOI: 10.4230/LIPIcs.CONCUR.2018.27
Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks

Authors: Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König

Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)

Abstract
The paper extends Bayesian networks (BNs) by a mechanism for dynamic changes to the probability distributions represented by BNs. One application scenario is the process of knowledge acquisition of an observer interacting with a system. In particular, the paper considers condition/event nets where the observer's knowledge about the current marking is a probability distribution over markings. The observer can interact with the net to deduce information about the marking by requesting certain transitions to fire and observing their success or failure. Aiming for an efficient implementation of dynamic changes to probability distributions of BNs, we consider a modular form of networks that form the arrows of a free PROP with a commutative comonoid structure, also known as term graphs. The algebraic structure of such PROPs supplies us with a compositional semantics that functorially maps BNs to their underlying probability distribution and, in particular, it provides a convenient means to describe structural updates of networks.
Cite as

Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König. Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{cabrera_et_al:LIPIcs.CONCUR.2018.27,
  author =	{Cabrera, Benjamin and Heindel, Tobias and Heckel, Reiko and K\"{o}nig, Barbara},
  title =	{{Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks}},
  booktitle =	{29th International Conference on Concurrency Theory (CONCUR 2018)},
  pages =	{27:1--27:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Schewe, Sven and Zhang, Lijun},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.27},
  URN =		{urn:nbn:de:0030-drops-95659},
  doi =		{10.4230/LIPIcs.CONCUR.2018.27},
  annote =	{Keywords: Petri nets, Bayesian networks, Probabilistic databases, Condition/Event nets, Probabilistic knowledge, Dynamic probability distributions}
}
Document
DOI: 10.4230/DagSemProc.06302.9
Rule-based Model Extraction from Source Code

Authors: Rui Correia, Carlos Matos, Mohammad El-Ramly, and Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 6302, Aspects For Legacy Applications (2007)

Abstract
In the context of an approach for reengineering legacy soft- ware systems at the architectural level, we present in this paper a reverse engineering methodology that uses a model de¯ned as a type graph to represent source-code subject to a code categorization process. Two al- ternative methods for referencing the source code are discussed: native vs. graphical. To represent the code, the native representation uses the abstract syntax tree while the graphical uses a programming language metamodel. Two options regarding the way that the graph can relate to the source code reference model are also considered: association model vs. direct link. The extraction of the program representation, complying to the type graph, is based on rules that categorize source code according to its purpose. The techniques to address this process, such as the code categorization rules, are shown together with examples.
Cite as

Rui Correia, Carlos Matos, Mohammad El-Ramly, and Reiko Heckel. Rule-based Model Extraction from Source Code. In Aspects For Legacy Applications. Dagstuhl Seminar Proceedings, Volume 6302, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{correia_et_al:DagSemProc.06302.9,
  author =	{Correia, Rui and Matos, Carlos and El-Ramly, Mohammad and Heckel, Reiko},
  title =	{{Rule-based Model Extraction from Source Code}},
  booktitle =	{Aspects For Legacy Applications},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6302},
  editor =	{Siobh\'{a}n Clarke and Leon Moonen and Ganesan Ramalingam},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06302.9},
  URN =		{urn:nbn:de:0030-drops-8815},
  doi =		{10.4230/DagSemProc.06302.9},
  annote =	{Keywords: Reverse engineering, Code categorization, Program representation}
}
Document
DOI: 10.4230/DagSemProc.04101.1
04101 Abstracts Collection – Language Engineering for Model-Driven Software Development

Authors: Jean Bézivin and Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
From 29.02. to 05.03.04, the Dagstuhl Seminar 04101 ``Language Engineering for Model-Driven Software Development'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jean Bézivin and Reiko Heckel. 04101 Abstracts Collection – Language Engineering for Model-Driven Software Development. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bezivin_et_al:DagSemProc.04101.1,
  author =	{B\'{e}zivin, Jean and Heckel, Reiko},
  title =	{{04101 Abstracts Collection – Language Engineering for Model-Driven Software Development}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.1},
  URN =		{urn:nbn:de:0030-drops-258},
  doi =		{10.4230/DagSemProc.04101.1},
  annote =	{Keywords: Dagstuhl Seminar 04101}
}
Document
DOI: 10.4230/DagSemProc.04101.10
Graph Transformation in a Nutshell

Authors: Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalizations proposed, often to a point where the original simple core is hardly recognizable. In this paper we provide a non-technical introduction to the basic concepts of typed graph transformation systems, completed with a survey of more advanced concepts, and explain some of its history and motivations.
Cite as

Reiko Heckel. Graph Transformation in a Nutshell. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{heckel:DagSemProc.04101.10,
  author =	{Heckel, Reiko},
  title =	{{Graph Transformation in a Nutshell}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.10},
  URN =		{urn:nbn:de:0030-drops-169},
  doi =		{10.4230/DagSemProc.04101.10},
  annote =	{Keywords: graph transformation}
}
Document
DOI: 10.4230/DagSemProc.04101.6
Application of Graph Transformation for Automating Web Service Discovery

Authors: Reiko Heckel and Alexey Cherchago

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
The paper represents current achievements of an ongoing research that aims to develop a formal approach supporting an automatic selection of a Web service sought by a requestor. The approach is based on the matching the requestor’s requirements for a "useful" service against the service description offered by the provider. We focus on the checking behavioral compatibility between operation contracts specifying pre-conditions and effects of required and provided operations. Graph transformation rules with positive application conditions are proposed as a visual formal notation for contracts. The desired dependence between requestor and provider contracts is determined by the semantic compatibility relation and syntactic matching procedure that is sound w.r.t. this relation.
Cite as

Reiko Heckel and Alexey Cherchago. Application of Graph Transformation for Automating Web Service Discovery. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{heckel_et_al:DagSemProc.04101.6,
  author =	{Heckel, Reiko and Cherchago, Alexey},
  title =	{{Application of Graph Transformation for Automating Web Service Discovery}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.6},
  URN =		{urn:nbn:de:0030-drops-121},
  doi =		{10.4230/DagSemProc.04101.6},
  annote =	{Keywords: SOA , graph transformation , contracts}
}
Document
DOI: 10.4230/DagSemProc.04101.3
04101 Summary – Language Engineering for Model-driven Software Development

Authors: Jean Bézivin and Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
This paper summarizes the objectives and structure of a seminar with the same title, held from February 29th to April 5th 2004 at Schloss Dagstuhl, Germany.
Cite as

Jean Bézivin and Reiko Heckel. 04101 Summary – Language Engineering for Model-driven Software Development. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bezivin_et_al:DagSemProc.04101.3,
  author =	{B\'{e}zivin, Jean and Heckel, Reiko},
  title =	{{04101 Summary –  Language Engineering for Model-driven Software Development}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.3},
  URN =		{urn:nbn:de:0030-drops-101},
  doi =		{10.4230/DagSemProc.04101.3},
  annote =	{Keywords: Dagstuhl Seminar 04101}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact